On efficient burst correcting residue polynomial codes
نویسندگان
چکیده
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملCodes Correcting Phased Burst Erasures
We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...
متن کاملEfficient erasure correcting codes
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully...
متن کاملImplementation of burst-correcting convolutional codes
A general procedure is formulated for decoding any convolutional code with decoding delay N blocks that corrects all bursts con6ned to r or fewer consecutive blocks followed by a guard space of at least N 1 consecutive error-free blocks. It is shown that all such codes can be converted to a form called “doubly systematic” which simplifies the decoding circuitry. The decoding procedure can then ...
متن کاملPhased burst error-correcting array codes
= p2 < h, by the assumption j 2 (3 / 2) m-(3 / 2). If t > t o we simply add points with errorvalue zero to the previously stated construction. This concludes 0 We have used the Hermitian curve because the rational points on this are so easy to handle, but this is probably also the case for many other curves. For a code C * (j) from a Hermitian curve, we have however more information in the deco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1970
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(70)90168-3